Evolving Non-Dominated Parameter Sets for Computational Models from Multiple Experiments
نویسندگان
چکیده
منابع مشابه
Evolving Non-Dominated Parameter Sets for Computational Models from Multiple Experiments
Creating robust, reproducible and optimal computational models is a key challenge for theorists in many sciences. Psychology and cognitive science face particular challenges as large amounts of data are collected and many models are not amenable to analytical techniques for calculating parameter sets. Particular problems are to locate the full range of acceptable model parameters for a given da...
متن کاملOn Metrics for Comparing Non Dominated Sets
Evolutionary multi objective optimisation EMO now boasts a proliferation of algorithms and bench mark problems We need principled ways to compare the performance of di erent EMO algorithms but this is com plicated by the fact that the result of an EMO run is not a single scalar value but a collection of vectors forming a non dominated set Various metrics for non dominated sets have been suggest...
متن کاملMultiple Criteria Performance Analysis of Non-dominated Sets Obtained by Multi-objective Evolutionary Algorithms for Optimisation
The paper shows the importance of a multi-criteria performance analysis in evaluating the quality of non-dominated sets. The sets are generated by the use of evolutionary algorithms, more specifically through SPEA2 or NSGA-II. Problem examples from different problem domains are analyzed on four criteria of quality. These four criteria namely cardinality of the nondominated set, spread of the so...
متن کاملModels, Computational Experiments and Reality
DSGE models are designed to mimic only certain aspects of reality, usually speci ed moments of observable data. They typically have other implications that are clearly false and lead to their immediate rejection if taken literally. Widely used calibration exercises compare the implications of DSGE models for the distribution of speci ed sample moments with the corresponding data. This paper sho...
متن کاملWell-dispersed subsets of non-dominated solutions for MOMILP problem
This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial General Intelligence
سال: 2013
ISSN: 1946-0163
DOI: 10.2478/jagi-2013-0001